An optimization problem for continuous submodular functions

نویسندگان

چکیده

"Real continuous submodular functions, as a generalization of the corresponding discrete notion to domain, gained considerable attention recently. The analog for entropy functions requires additional properties: real function defined on non-negative orthant $\R^n$ is entropy-like (EL) if it submodular, takes zero at zero, non-decreasing, and has Diminishing Returns property. Motivated by problems concerning Shannon complexity multipartite secret sharing, special case following general optimization problem considered: find minimal cost those EL which satisfy certain constraints. In our an maximal value $n$ partial derivatives zero. Another possibility could be supremum range. constraints are specified smooth bounded surface $S$ cutting off downward closed subset. An feasible internal points left right differ least one. A lower bound given in terms normals $S$. tight when linear. two-dimensional same convex or concave It shown that optimal not necessarily unique. paper concludes with several open problems."

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Submodular Functions: Optimization and Approximation

Submodular functions are discrete analogue of convex functions, arising in various fields of applied mathematics including game theory, information theory, and queueing theory. This survey aims at providing an overview on fundamental properties of submodular functions and recent algorithmic developments of their optimization and approximation. For submodular function minimization, the ellipsoid...

متن کامل

Robust Budget Allocation via Continuous Submodular Functions

The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem are rarely known exactly, and using wrong parameters can lead to undesirable outcomes. We hence revisit a continuous version of the Budget Allocation or Bipar...

متن کامل

A Continuous Optimization Model for Partial Digest Problem

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

متن کامل

Submodular Functions: Learnability, Structure, and Optimization

Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In this work we study submodular functions from a learning theoretic angle. We provide algorithms for learning submodular functions, as well as lower bounds on the...

متن کامل

Multi-Agent Combinatorial Optimization under Submodular Functions

Submodular functions are the discrete ananlogue of convexity and generalize many known and well studied settings. They capture several economic principles such as decreasing marginal cost and correlated utilities. Multi-agent allocation problems over submodular functions arise in a variety of natural scenarios and have been the subject of extensive study over the last decade. In this proposal I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Universitatis Babe?-Bolyai

سال: 2021

ISSN: ['1224-8754', '2065-9458']

DOI: https://doi.org/10.24193/subbmath.2021.1.17